/*
 * @lc app=leetcode.cn id=313 lang=cpp
 *
 * [313] 超级丑数
 */

// @lc code=start
#include <bits/stdc++.h>
using namespace std;
class Solution {
public:
    int nthSuperUglyNumber(int n, vector<int>& primes) {
        primes.push_back(INT_MAX);
        priority_queue<int> q;
        q.push(1);
        for (size_t i = 1; i < n; i++)
        {
            int tmp = q.top();
            for (size_t j = 0; j < primes.size() - 1; j++)
            {
                if(tmp * )
            }
            
        }
        
    }
};
// @lc code=end

